22 research outputs found

    A multi-biometric iris recognition system based on a deep learning approach

    Get PDF
    YesMultimodal biometric systems have been widely applied in many real-world applications due to its ability to deal with a number of significant limitations of unimodal biometric systems, including sensitivity to noise, population coverage, intra-class variability, non-universality, and vulnerability to spoofing. In this paper, an efficient and real-time multimodal biometric system is proposed based on building deep learning representations for images of both the right and left irises of a person, and fusing the results obtained using a ranking-level fusion method. The trained deep learning system proposed is called IrisConvNet whose architecture is based on a combination of Convolutional Neural Network (CNN) and Softmax classifier to extract discriminative features from the input image without any domain knowledge where the input image represents the localized iris region and then classify it into one of N classes. In this work, a discriminative CNN training scheme based on a combination of back-propagation algorithm and mini-batch AdaGrad optimization method is proposed for weights updating and learning rate adaptation, respectively. In addition, other training strategies (e.g., dropout method, data augmentation) are also proposed in order to evaluate different CNN architectures. The performance of the proposed system is tested on three public datasets collected under different conditions: SDUMLA-HMT, CASIA-Iris- V3 Interval and IITD iris databases. The results obtained from the proposed system outperform other state-of-the-art of approaches (e.g., Wavelet transform, Scattering transform, Local Binary Pattern and PCA) by achieving a Rank-1 identification rate of 100% on all the employed databases and a recognition time less than one second per person

    Electrocardiogram Pattern Recognition and Analysis Based on Artificial Neural Networks and Support Vector Machines: A Review

    Full text link

    Classification of frontal cortex haemodynamic responses during cognitive tasks using wavelet transforms and machine learning algorithms

    No full text
    Recent advances in neuroimaging demonstrate the potential of functional near-infrared spectroscopy (fNIRS) for use in brain-computer interfaces (BCIs). fNIRS uses light in the near-infrared range to measure brain surface haemoglobin concentrations and thus determine human neural activity. Our primary goal in this study is to analyse brain haemodynamic responses for application in a BCI. Specifically, we develop an efficient signal processing algorithm to extract important mental-task-relevant neural features and obtain the best possible classification performance. We recorded brain haemodynamic responses due to frontal cortex brain activity from nine subjects using a 19-channel fNIRS system. Our algorithm is based on continuous wavelet transforms (CWTs) for multi-scale decomposition and a soft thresholding algorithm for de-noising. We adopted three machine learning algorithms and compared their performance. Good performance can be achieved by using the de-noised wavelet coefficients as input features for the classifier. Moreover, the classifier performance varied depending on the type of mother wavelet used for wavelet decomposition. Our quantitative results showed that CWTs can be used efficiently to extract important brain haemodynamic features at multiple frequencies if an appropriate mother wavelet function is chosen. The best classification results were obtained by a specific combination of input feature type and classifier. © 2012 IPEM.

    NEURAL NETWORK CLASSIFICATION OF BRAIN HEMODYNAMIC RESPONSES FROM FOUR MENTAL TASKS

    No full text
    We investigate subjects' brain hemodynamic activities during mental tasks using a nearinfrared spectroscopy. A wavelet and neural network-based methodology is presented for recognition of brain hemodynamic responses. The recognition is performed by a single layer neural network classifier according to a backpropagation algorithm with two error minimizing techniques. The performance of the classifier varied depending on the neural network model, but the performance was usually at least 90%. The classifier usually converged faster and attained a somewhat greater level of performance when an input was presented with only relevant features. The overall classification rate was higher than 94%. The study demonstrates the accurate classifiablity of human brain hemodynamic useful in various brain studies. © 2011 Copyright DGIST.

    A wavelet based method for detecting and localizing epileptic neural spikes in EEG

    No full text
    The recording of seizures is of primary interest in the evaluation of epileptic transients. Seizure is the phenomenon of rhythmicity discharge from either a local area or the whole brain and the individual behaviour usually lasts from seconds to minutes. Since seizures in general occur infrequently and unpredictably, an automatic detection of seizures during long-term electroencephalograph (EEG) recordings is highly recommended. As EEG signals are nonstationary, the conventional methods of frequency analysis are not successful for diagnostic purposes. This paper proposes a new method for the detection of epileptic transients in EEG by using continuous wavelet transform (CWT) with suitable mother wavelet functions and thresholding method. We demonstrate the efficiency of our method on data to identify and clearly locate in time the seizure activities. The method is superior both in separation from noise and in identifying superimposed epileptic action potentials based on in sets of combined scales. We prove that this method is fast and simple which also reduces real time computations. Copyright © 2009 ACM

    Path planning algorithm using the values clustered by k-means

    No full text
    Path planning has been studied focusing on finding the shortest paths or smallest movements. The previous methods, however, are not suitable for stable movements on real environments in which various dynamic obstacles exist. In this paper, we suggest a path planning algorithm that makes the movement of an autonomous robot easier in a dynamic environment. Our focus is based on finding optimal movements for mobile robot to keep going on a stable situation but not on finding shortest paths or smallest movements. The proposed algorithm is based on GA and uses kmeans cluster analysis algorithm to recognize the much more information of obstacles distribution in real-life space. Simulation results confirmed to have better performance and stability of the proposed algorithm. In order to validate our results, we compared with a previous algorithm based on grid maps-based algorithm for static obstacles and dynamic obstacles environment. © 2010 ISAROB

    FNIRS motion artifact correction for overground walking using entropy based unbalanced optode decision and wavelet regression neural network

    No full text
    Functional near-infrared spectroscopy (fNIRS) can be employed to investigate brain activation by measuring the absorption of near-infrared light through an intact skull. fNIRS can measure hemoglobin signals, which are similar to functional magnetic resonance imaging (fMRI) blood-oxygen-level-dependent (BOLD) signals. The general linear model (GLM), which is a standard method for fMRI imaging, has been applied for fNIRS imaging analysis. However, when the subject moves, the fNIRS signal can contain artifacts during the measurement. These artifacts are called motion artifacts. However, the GLM has a drawback of failure because of motion artifacts. Recently, wavelet and hemodynamic response function based algorithms are popular detrending methods of motion artifact correction for fNIRS signals. However, these methods cannot show impressive performance in harsh environments such as overground walking tasks. This paper suggests a new motion artifact correction method that uses an entropy based unbalanced optode decision rule and a wavelet regression based back propagation neural network. Through the experiments, the performance of the proposed method was proven using graphic results, a brain activation map, and an objective performance index when compared with conventional detrending algorithms. © 2017 IEEE.

    Path planning algorithm using the values clustered by k-means

    No full text
    Path planning has been studied focusing on finding the shortest paths or smallest movements. The previous methods, however, are not suitable for stable movements on real environments in which various dynamic obstacles exist. In this paper, we suggest a path planning algorithm that makes the movement of an autonomous robot easier in a dynamic environment. Our focus is based on finding optimal movements for mobile robot to keep going on a stable situation but not on finding shortest paths or smallest movements. The proposed algorithm is based on GA and uses kmeans cluster analysis algorithm to recognize the much more information of obstacles distribution in real-life space. Simulation results confirmed to have better performance and stability of the proposed algorithm. In order to validate our results, we compared with a previous algorithm based on grid maps-based algorithm for static obstacles and dynamic obstacles environment. © 2010 ISAROB
    corecore